Modeling and Performance Evaluation of Advanced Diffusion with Classified Data in Vehicular Sensor Networks

International audienceIn this paper, we propose a newly distributed protocol called ADCD to manage information harvesting and distribution in Vehicular Sensor Networks (VSN). ADCD aims at reducing the generated overhead avoiding network congestions as well as long latency to deliver the harvested information. The concept of ADCD is based on the characterization of sensed information (i.e. based on its importance, location and time of collection) and the diffusion of this information accordingly. Furthermore, ADCD uses an adaptive broadcasting strategy to avoid overwhelming users with messages in which they have no interest. Also, we propose in this paper a new probabilistic model for ADCD based on Markov chain. This one aims at optimally tune the parameters of ADCD, such as the optimal number of broadcaster nodes. The analytical and simulation results based on different metrics, like the overhead, the delivery ratio, the probability of a complete transmission and the minimal number of hops, are presented. These results illustrate that ADCD allows to mitigate the information redundancy and its delivery with an adequate latency while making the reception of interesting data for the drivers (related to their location) more adapted. Moreover, the ADCD protocol reduces the overhead by 90% compared to the classical broadcast and an adapted version of MobEyes. The ADCD overhead is kept stable whatever the vehicular density

A Job Market Signaling Scheme for Incentive and Trust Management in Vehicular Ad Hoc Networks

International audienceIn collaborative wireless networks with a low infrastructure, the presence of misbehaving nodes can have a negative impact on network performance. In particular, we are interested in dealing with this nasty presence in road safety applications, based on vehicular ad hoc networks (VANETs). In this work, we consider as harmful the presence of malicious nodes, which spread false and forged data; and selfish nodes, which cooperate only for their own benefit. To deal with this, we propose a Distributed Trust Model (DTM2), adapted from the job market signaling model. DTM2 is based on allocating credits to nodes and securely managing these credits. To motivate selfish nodes to cooperate more, our solution establishes the cost of reception to access data, forcing them to earn credits. Moreover, to detect and exclude malicious nodes, DTM2 requires the cost of sending, using signaling values inspired form economics and based on the node's behavior, so that the more a node is malicious, the higher its sending cost, thus limiting their participation in the network. Similarly, rewards are given to nodes whose sent messages are considered as truthful, and that paid a sending cost considered as correct. The latter is a guarantee for the receivers about the truthfulness of the message since, in case of message refusal, the source node is not rewarded despite its payment. We validated DTM2 via a theoretical study using Markov chains; and with a set of simulations, in both urban and highway scenarios. Both theoretical and simulation results show that DTM2 excludes from the network 100% of malicious nodes, without causing any false positive detection. Moreover, our solution guarantees a good ratio of reception even in the presence of selfish nodes

Vehicular ad hoc networks : towards efficient, collaborativeand reliable data dissemination

Les réseaux ad hoc véhiculaires (VANETs) permettent le partage de différents types de données entre les véhicules, de manière collaborative. Dans cette thèse, nous nous sommes tout particulièrement intéressés aux applications de sûreté et de sécurité routière, dédiées à l'échange des informations sur l'état de l'environnement routier. Les contraintes de ces applications en termes de qualité de services sont des plus rigoureuses, car l'acheminent de leurs données doit être exhaustif et ne souffrir d'aucun retard pour assurer une information utile et en temps opportun au profit de tous les usagers concernés. Cet acheminement doit faire face aux difficultés induites par la dispersion et la forte mobilité des véhicules, l'absence ou l'insuffisance d'infrastructure, la densité variable du réseau, la surcharge en informations à envoyer et l'étendue des zones géographiques à couvrir. En effet, la problématique de diffusion des données dans les VANETs s'avère non-triviale et de nombreux verrous scientifiques doivent être levés pour permettre un support efficace, collaboratif et fiable pour les applications de sûreté et de sécurité routière.Plus précisément, nous aborderons la problématique de la dissémination collaborative en se posant trois questions : “comment disséminer les données ? À quel moment le faire ? Mais aussi quoi disséminer et comment inciter à le faire ? ” Nous avons apporté des réponses à travers les trois contributions de cette thèse. La première consiste à proposer une stratégie de dissémination efficace, qui soit adaptée à l'importance de l'information échangée et à sa durée de vie, permettant ainsi d'éviter un processus de diffusion intensif. Celui-ci est inapproprié dans ce cas de figure, car il génère de la congestion et beaucoup de redondance. Une étude de performances par simulation est réalisée, laquelle montre une diminution de 90% du taux de messages redondants par rapport au cas de la diffusion par inondation. Afin d'améliorer plus encore les performances du processus de diffusion des messages de sûreté, nous proposons, dans un second temps, un ordonnanceur pour l'accès au canal de communication qui a pour objectif de réduire le nombre de collisions dues aux synchronisations afférentes à l'utilisation du multi-canal dans le standard IEEE 802.11p/1609.4 et donc élever le taux de réception des données. Nous basons notre proposition sur la théorie de l'arrêt optimal, qui décide du moment opportun pour l'envoi d'une information en conciliant occupation du canal, efficacité de l'envoi et délai d'ajournement toléré par une information. Dans notre cas, la théorie de l'arrêt optimal est formulée par un processus de décision Markovien (MDP). Nous montrons ainsi par simulation une amélioration substantielle du taux de réception (de 25%) et une diminution importante des pertes (de 47%).Après s'être intéressé à l'aspect quantitatif des performances du réseau, nous nous intéresserons ensuite à l'amélioration de la fiabilité du processus de diffusion. Cette fiabilité est obtenue grâce à l'incitation des véhicules à la coopération et à l'exclusion des véhicules malicieux de celui-ci. Ceci est réalisé au travers de la proposition d'un modèle de confiance, inspiré des jeux de signaux. Le modèle crée une situation d'équilibre, tel que les différentes parties le composant ne soient pas tentées de le contourner, ainsi découle une auto-sélection des véhicules, laquelle est rapide et peu coûteuse. À notre connaissance, notre modèle est le seul à s'attaquer aux effets néfastes des deux types de véhicules, malicieux et égoïstes, en même temps. Comme précédemment, nous évaluons les performances de notre solution au travers d'une modélisation par une chaîne de Markov et divers jeux de simulation. Ceci a permis de montrer que 100% des véhicules malicieux sont exclus, avec le maintien d'un taux de coopération élevé dans le réseau, soit une amélioration de 42%Vehicular Ad Hoc Networks (VANETs) allow sharing different kinds of data between vehicles in a collaborative way. In this thesis, we are particularly interested in road safety applications, designed for the exchange of information on road traffic and conditions. This kind of applications have strict Quality of Service (QoS) requirements, as data must be routed thoroughly and without any delays so for assuring the timely delivery of useful information to the drivers. In this context, data routing must face several issues raised by the high mobility and dispersion of vehicles, inadequate or completely lacking infrastructure, a variable network density, network saturation due to the large of information to deliver, and the size of the geographical areas to cover. Indeed, the problem of data dissemination in VANETs is non-trivial, and several research challenges must be solved in order to provide an efficient, collaborative, and reliable support for road safety applications. Specifically, we will address the problem of collaborative data dissemination through the following three questions: “How to perform data dissemination?”, “When should we do it?”, and “What must be disseminated?” We have provided answers to these questions through the three contributions of this thesis. Our first contribution is an efficient dissemination strategy, specifically tailored to the importance of the exchanged information as well as its lifespan, which is able to avoid the intensive dissemination process that generates network congestion and data redundancy. We confirm our statements and validate the performance of our solution by modeling it using a discrete-time Markov chain, which demonstrates the number of necessary retransmissions for all concerned vehicles to receive information. Moreover, we performed extensive simulations that show a reduction of up to 90% of redundant messages with respect to message flooding dissemination strategies. Next, in order to further improve the road safety message dissemination process, we propose a communications channel access scheduler, which aims at reducing the number of collisions caused by IEEE 802.11p/1609.4 multi-channel synchronizations, and thus improving the data reception rate. We base our solution on the optimal stopping theory, which chooses the right moment to send information by balancing the channel occupancy rate, the data delivery efficiency, and the maximum deferment delay tolerated by the information. To this end, we formulate the optimal stopping theory through a Markov decision process (MDP). We show through simulation-based evaluations an improvement of the reception rate of up to 25% and a reduction of up to 47% of message losses. Finally, after being interested in the quantitative aspect of network performance, we centered our efforts on improving the reliability of the dissemination process, which is obtained by motivating vehicles to cooperate and evicting malicious vehicles from the process. To this end, we propose a trust model inspired on signaling games, which are a type of dynamic Bayesian games. Through the use of our model, equilibrium is achieved, thus resulting in a fast and low-cost vehicle self-selection process. We define the parameters of our trust model through a discrete-time Markov chain model. To the best of our knowledge, our solution is the only existing solution that tackles the negative effects introduced by the presence of both malicious and selfish vehicles in a VANET. We evaluated the performance of our solution by modeling it using a Markov chain, and a set of simulations. Our results show that up to 100% of malicious vehicles are evicted while keeping a high cooperation rate, thus achieving an improvement of 42% when compared to other similar solution

Réseaux ad hoc véhiculaires : vers une dissémination de données efficace, coopérative et fiable

Vehicular Ad Hoc Networks (VANETs) allow sharing different kinds of data between vehicles in a collaborative way. In this thesis, we are particularly interested in road safety applications, designed for the exchange of information on road traffic and conditions. This kind of applications have strict Quality of Service (QoS) requirements, as data must be routed thoroughly and without any delays so for assuring the timely delivery of useful information to the drivers. In this context, data routing must face several issues raised by the high mobility and dispersion of vehicles, inadequate or completely lacking infrastructure, a variable network density, network saturation due to the large of information to deliver, and the size of the geographical areas to cover. Indeed, the problem of data dissemination in VANETs is non-trivial, and several research challenges must be solved in order to provide an efficient, collaborative, and reliable support for road safety applications. Specifically, we will address the problem of collaborative data dissemination through the following three questions: “How to perform data dissemination?”, “When should we do it?”, and “What must be disseminated?” We have provided answers to these questions through the three contributions of this thesis. Our first contribution is an efficient dissemination strategy, specifically tailored to the importance of the exchanged information as well as its lifespan, which is able to avoid the intensive dissemination process that generates network congestion and data redundancy. We confirm our statements and validate the performance of our solution by modeling it using a discrete-time Markov chain, which demonstrates the number of necessary retransmissions for all concerned vehicles to receive information. Moreover, we performed extensive simulations that show a reduction of up to 90% of redundant messages with respect to message flooding dissemination strategies. Next, in order to further improve the road safety message dissemination process, we propose a communications channel access scheduler, which aims at reducing the number of collisions caused by IEEE 802.11p/1609.4 multi-channel synchronizations, and thus improving the data reception rate. We base our solution on the optimal stopping theory, which chooses the right moment to send information by balancing the channel occupancy rate, the data delivery efficiency, and the maximum deferment delay tolerated by the information. To this end, we formulate the optimal stopping theory through a Markov decision process (MDP). We show through simulation-based evaluations an improvement of the reception rate of up to 25% and a reduction of up to 47% of message losses. Finally, after being interested in the quantitative aspect of network performance, we centered our efforts on improving the reliability of the dissemination process, which is obtained by motivating vehicles to cooperate and evicting malicious vehicles from the process. To this end, we propose a trust model inspired on signaling games, which are a type of dynamic Bayesian games. Through the use of our model, equilibrium is achieved, thus resulting in a fast and low-cost vehicle self-selection process. We define the parameters of our trust model through a discrete-time Markov chain model. To the best of our knowledge, our solution is the only existing solution that tackles the negative effects introduced by the presence of both malicious and selfish vehicles in a VANET. We evaluated the performance of our solution by modeling it using a Markov chain, and a set of simulations. Our results show that up to 100% of malicious vehicles are evicted while keeping a high cooperation rate, thus achieving an improvement of 42% when compared to other similar solutionsLes réseaux ad hoc véhiculaires (VANETs) permettent le partage de différents types de données entre les véhicules, de manière collaborative. Dans cette thèse, nous nous sommes tout particulièrement intéressés aux applications de sûreté et de sécurité routière, dédiées à l'échange des informations sur l'état de l'environnement routier. Les contraintes de ces applications en termes de qualité de services sont des plus rigoureuses, car l'acheminent de leurs données doit être exhaustif et ne souffrir d'aucun retard pour assurer une information utile et en temps opportun au profit de tous les usagers concernés. Cet acheminement doit faire face aux difficultés induites par la dispersion et la forte mobilité des véhicules, l'absence ou l'insuffisance d'infrastructure, la densité variable du réseau, la surcharge en informations à envoyer et l'étendue des zones géographiques à couvrir. En effet, la problématique de diffusion des données dans les VANETs s'avère non-triviale et de nombreux verrous scientifiques doivent être levés pour permettre un support efficace, collaboratif et fiable pour les applications de sûreté et de sécurité routière.Plus précisément, nous aborderons la problématique de la dissémination collaborative en se posant trois questions : “comment disséminer les données ? À quel moment le faire ? Mais aussi quoi disséminer et comment inciter à le faire ? ” Nous avons apporté des réponses à travers les trois contributions de cette thèse. La première consiste à proposer une stratégie de dissémination efficace, qui soit adaptée à l'importance de l'information échangée et à sa durée de vie, permettant ainsi d'éviter un processus de diffusion intensif. Celui-ci est inapproprié dans ce cas de figure, car il génère de la congestion et beaucoup de redondance. Une étude de performances par simulation est réalisée, laquelle montre une diminution de 90% du taux de messages redondants par rapport au cas de la diffusion par inondation. Afin d'améliorer plus encore les performances du processus de diffusion des messages de sûreté, nous proposons, dans un second temps, un ordonnanceur pour l'accès au canal de communication qui a pour objectif de réduire le nombre de collisions dues aux synchronisations afférentes à l'utilisation du multi-canal dans le standard IEEE 802.11p/1609.4 et donc élever le taux de réception des données. Nous basons notre proposition sur la théorie de l'arrêt optimal, qui décide du moment opportun pour l'envoi d'une information en conciliant occupation du canal, efficacité de l'envoi et délai d'ajournement toléré par une information. Dans notre cas, la théorie de l'arrêt optimal est formulée par un processus de décision Markovien (MDP). Nous montrons ainsi par simulation une amélioration substantielle du taux de réception (de 25%) et une diminution importante des pertes (de 47%).Après s'être intéressé à l'aspect quantitatif des performances du réseau, nous nous intéresserons ensuite à l'amélioration de la fiabilité du processus de diffusion. Cette fiabilité est obtenue grâce à l'incitation des véhicules à la coopération et à l'exclusion des véhicules malicieux de celui-ci. Ceci est réalisé au travers de la proposition d'un modèle de confiance, inspiré des jeux de signaux. Le modèle crée une situation d'équilibre, tel que les différentes parties le composant ne soient pas tentées de le contourner, ainsi découle une auto-sélection des véhicules, laquelle est rapide et peu coûteuse. À notre connaissance, notre modèle est le seul à s'attaquer aux effets néfastes des deux types de véhicules, malicieux et égoïstes, en même temps. Comme précédemment, nous évaluons les performances de notre solution au travers d'une modélisation par une chaîne de Markov et divers jeux de simulation. Ceci a permis de montrer que 100% des véhicules malicieux sont exclus, avec le maintien d'un taux de coopération élevé dans le réseau, soit une amélioration de 42

DTM²: Adapting job market signaling for distributed trust management in vehicular ad hoc networks

International audienceIn this paper, we address the issue of the presence of malicious and selfish nodes in Vehicular Ad Hoc Networks (VANETs). Malicious nodes spread false and forged messages, while selfish nodes only cooperate for their own interest. To deal with this, we propose DTM², a Distributed Trust Model inspired by Spence's Job Market model from Economics. In our model, a sender node transmits a signal with its message. This signal represents a guarantee of the truthfulness of the message for the potential receivers. In order to use the signal, the sender node has to pay a cost, which depends on the value of the signal and its own behavior. Therefore, the worse the behavior of the sender node, the more expensive the signal cost. This model deters the sender nodes from acting as malicious nodes. Similarly, cooperation of the sender nodes is rewarded proportionally to the signal's value. We validated DTM² via extensive simulation in an urban scenario. We show that our approach is able to detect and evict gradually all malicious nodes in a network composed of 25%, and 50% of them. Moreover, our solution greatly decreases the ratio of corrupted and false data sent through a network to levels as low as 0%, and it increases the participation ratio of selfish nodes by 20%

L'instant propice à l'envoi d'un message sur la couche IEEE 802.11p/1609.4

International audienceLe protocole IEEE 1609.4 a été proposé afin d'améliorer la délivrance des messages dans les réseaux Ad Hoc véhiculaires en rajoutant la notion du multi-canal au standard IEEE 802.11p. Pour assurer de bonnes performances aux applications de sécurité routière, la première moitié de l'intervalle de synchronisation leur est dédiée, chaque véhicule écoute alors sur le canal de contrôle (CCH). La deuxième moitié est dédiée aux applications de conforts, un véhicule peut rester sur le canal de contrôle ou changer pour un des six canaux de service (SCH). Néanmoins , ce mécanisme cause des collisions synchronisées au début de l'intervalle dédié au CCH, ainsi qu'un important déséquilibre de charge, tout deux causés par la mise en attente des messages de sécurité routière durant la deuxième moitié de l'intervalle. Nous proposons DMS, un ordonnanceur distribué au niveau de la couche MAC, pour décider de l'instant optimal pour l'envoi d'un message de sécurité routière, afin de lui assurer un haut taux de réception, quitte à allonger d'un peu son délai de transmission. DMS se base sur la théorie de l'arrêt optimal et prend en considération le délai maximum supporté par le message à envoyer. Nos simulations montrent que lors de l'utilisation de DMS, la charge du canal durant l'intervalle CCH est équilibrée, ce qui augmente fortement le taux de réception des messages et décroit le taux de perte

Trust and exclusion in vehicular ad hoc networks: an economic incentive model based approach

International audienceIn this body of work, we are interested in road safety applications such as advanced driver assistance systems, based on Vehicular Ad Hoc Networks (VANETs). One of the particular characteristics of this kind of networks is the continuous sharing of safety information by its nodes. Since this kind of information is time sensitive, a node cannot spend much time to verify its validity with an authority. However, the presence of malicious and selfish nodes in VANETs corrupts exchanged data, and lowers the overall data reception ratio in the network. To tackle this, we propose a new incentive model with exclusion for malicious nodes called VIME. VIME is inspired from the signaling theory from economics. It is based on managing a credit count that each node receives at the initialization of the application. Straightforwardly, VIME is based on two pillars. On the one hand, a node pays an appropriate cost for each sent message, which is seen by the receivers as a guarantee from the source about the truthfulness of the information. On the other hand, nodes get rewarded for cooperating in the network. The proposed economic model allows computing the amounts to be paid and those to be awarded in order to fight selfish and malicious nodes. We validate our approach via simulations. We show that VIME is able to detect and evict gradually all malicious nodes in the network, and decreases the ratio of corrupted and false sent data until reaching zero. Moreover, it has a positive impact on the participation of selfish nodes, as our approach increases the average ratio of sent data as to equal the ideal case's percentage, when no selfish node is present

Advanced diffusion of classified data in vehicular sensor networks

International audienceIn this paper, we propose a newly distributed protocol called ADCD to manage information harvesting, and distribution in Vehicular Sensor Networks (VSN). The concept of ADCD is based on the characterization of sensed information (i.e. its importance, location and time of collection) and the diffusion of this information accordingly. Furthermore, ADCD uses an adaptive broadcasting strategy to avoid overwhelming users with messages for which they have no interests. Thanks to this adaptive broadcasting strategy, ADCD limits the generated overhead avoiding network congestions as well as long latency to deliver the harvested information, which are the main limitations of other existing protocols. Moreover, it is designed to be flexible regarding the use of roadside units or not, which is not the case in other schemes in the literature. To reach its objectives, ADCD operations are divided into three steps: (i) classification of data and the identification of their target area of diffusion, (ii) data-centric election of the set of broadcasters to avoid broadcasting redundancy, and (iii) iterative process for data dispatching in a targeted area. Performance evaluation shows that the ADCD protocol allows for mitigating the information redundancy and its delivery with an adequate latency while making the reception of interesting data for the drivers (related to their location) more adapted. Moreover, the ADCD protocol reduces the overhead by 90% compared to the classical broadcast and an adapted version of MobEyes. The ADCD overhead is kept stable whatever the vehicular density

To Send or To Defer? Improving the IEEE 802.11p/1609.4 Transmission Scheme

International audienceThe IEEE 1609.4 protocol has been proposed to improve message delivery in Vehicular Ad Hoc Networks (VANETs) through its multi-channel usage. To ensure good performance for safety applications, during the first half of a synchronization interval, each vehicle tunes a dedicated Control CHannel (CCH) to exchange safety messages, and during the second half, either it stays on the CCH or switches to one of the six available Service CHannels (SCH). As demonstrated in the literature, such behavior leads safety messages to suffer from synchronous collisions at the start of the CCH interval, as well as from high end-to-end delays caused by the queue-up during the SCH intervals. To address these issues, we propose DMS, a Distributed MAC Scheduler that relies on the Optimal Stopping Theory to evenly balance the channel load by introducing tolerated deferring delays before sending a message. This ensures a higher reception probability and lower collision risks, while complying with Enhanced Distributed Channel Access (EDCA) access categories (ACs). Simulation study shows the ability of our approach to increase the reception rate of safety messages up to 25%, to decrease loses up to 47%, and to improve the load balancing during the CCH interval